Programming for solving plane rigid frame based on MATLAB
نویسندگان
چکیده
منابع مشابه
Modified FGP approach and MATLAB program for solving multi-level linear fractional programming problems
In this paper, we present modified fuzzy goal programming (FGP) approach and generalized MATLAB program for solving multi-level linear fractional programming problems (ML-LFPPs) based on with some major modifications in earlier FGP algorithms. In proposed modified FGP approach, solution preferences by the decision makers at each level are not considered and fuzzy goal for the decision vectors i...
متن کاملA Genetic Programming-based Scheme for Solving Fuzzy Differential Equations
This paper deals with a new approach for solving fuzzy differential equations based on genetic programming. This method produces some trial solutions and seeks the best of them. If the solution cannot be expressed in a closed analytical form then our method produces an approximation with a controlled level of accuracy. Furthermore, the numerical results reveal the potential of the proposed appr...
متن کاملSolving for a quadratic programming with a quadratic constraint based on a neural network frame
In many applications, a class of optimization problems called quadratic programming with a special quadratic constraint (QPQC) often occurs, such as in the "elds of maximum entropy spectral estimation, FIR "lter design with time}frequency constraint and design of an FIR "lter bank with perfect reconstruction property. In order to deal with this kind of optimization problems and be inspired by t...
متن کاملSolving Fractional Programming Problems based on Swarm Intelligence
This paper presents a new approach to solve Fractional Programming Problems (FPPs) based on two different Swarm Intelligence (SI) algorithms. The two algorithms are: Particle Swarm Optimization, and Firefly Algorithm. The two algorithms are tested using several FPP benchmark examples and two selected industrial applications. The test aims to prove the capability of the SI algorithms to s...
متن کاملA Constraint Programming Approach for Solving Rigid Geometric Systems
This paper introduces a new rigidification method -using interval constraint programming techniquesto solve geometric constraint systems. Standard rigidification techniques are graph-constructive methods exploiting the degrees of freedom of geometric objects. They work in two steps: a planning phase which identifies rigid clusters, and a solving phase which computes the coordinates of the geome...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2020
ISSN: 2261-236X
DOI: 10.1051/matecconf/202031909003